On groups of odd prime-power degree that contain a full cycle
نویسنده
چکیده
The Graph Theory of Brian Alspach Simon Fraser University Burnaby, B.C. May 25 – 29, 2003 In multi-author talks “?” indicates the speaker.
منابع مشابه
Permutation groups and derangements of odd prime order
Let G be a transitive permutation group of degree n. We say that G is 2′elusive if n is divisible by an odd prime, but G does not contain a derangement of odd prime order. In this paper we study the structure of quasiprimitive and biquasiprimitive 2′-elusive permutation groups, extending earlier work of Giudici and Xu on elusive groups. As an application, we use our results to investigate autom...
متن کاملRecognition by prime graph of the almost simple group PGL(2, 25)
Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...
متن کاملA note on large Cayley graphs of diameter two and given degree
Let ) 2 , (d C , ) 2 , (d AC , and ) 2 , (d CC be the largest order of a Cayley graph of a group, an Abelian group, and a cyclic group, respectively, of diameter 2 and degree d. The currently known best lower bounds on these parameters are 2 / ) 1 ( ) 2 , ( 2 d d C for degrees 1 2 q d where q is an odd prime power, ) 4 )( 8 / 3 ( ) 2 , ( 2 d d AC where 2 4 q d for an odd prime p...
متن کاملPermutation Representations of the Finite Classical Groups of Small Degree or Rank
In 1832, Galois [ll, pp. 41 l-4121 determined the smallest degree of a faithful permutation representation of PSL(2, 4) for q a prime; the case q a prime power was handled much later, reportedly first in unpublished work of Moore in 1894 (see Loewy [22]). Th e corresponding problem was solved for Sp(4, q), q an odd prime or prime power, by Dickson [9] and Mitchell [27], respectively; and for SL...
متن کاملLarge graphs of diameter two and given degree
Let r(d, 2), C(d, 2), and AC(d, 2) be the largest order of a regular graph, a Cayley graph, and a Cayley graph of an Abelian group, respectively, of diameter 2 and degree d. The best currently known lower bounds on these parameters are r(d, 2) ≥ d2 − d + 1 for d − 1 an odd prime power (with a similar result for powers of two), C(d, 2) ≥ (d+ 1)2/2 for degrees d = 2q − 1 where q is an odd prime p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 299 شماره
صفحات -
تاریخ انتشار 2005